Parity check Time Limit: 2000MS Memory Limit: 524288KB Problem Description Fascinated with the computer games, Gabriel even forgets to study. Now she needs to finish her homework, and there i
Parity check Time Limit: 2000MS Memory Limit: 524288KB Problem Description Fascinated with the computer games, Gabriel even forgets to study. Now she needs to finish her homework, and there i
Problem Description Fascinated with the computer games, Gabriel even forgets to study. Now she needs to finish her homework, and there is an easy problem: f(n)= She is required to calculate f(n)
山东省2019年ACM省赛题目，10thACM省赛题目
Problem Description With given integers a,b,c, you are asked to judge whether the following statement is true: “For any x, if a⋅x2+b⋅x2+c=0 , then x is an integer.” ...The
Problem DescriptionFascinated with the computer games, Gabriel even forgets to study. Now she needs to finish her homework, and there is an easy problem:f(n)=She is required to calculate f(n) mod 2 ...
quadratic equation Time Limit: 2000MS Memory Limit: 131072KB Problem Description With given integers a,b,c, you are asked to judge whether the following statement is true: "For any ...
浙江省2018年ACM省赛题目，15届ACM省赛题目
J题：company 题目描述 There are n kinds of goods in the company, with each of them has a inventory of cntiand direct unit benefit vali. Now you find due to price changes, for any goods sold on da...
Description Hmz likes to play fireworks, especially when they are put regularly. Now he puts some fireworks in a line. This time he put a trigger on each firework. With that trigger, each firewo
Problem Description There are n kinds of goods in the company, with each of them has a inventory of and direct unit benefit . Now you find due to price changes, for any goods sold on day i, if its
Problem DescriptionHmz likes to play fireworks, especially when they are put regularly. Now he puts some fireworks in a line. This time he put a trigger on each firework. With that trigger, each ...
sum of power Time Limit: 1000MS Memory Limit: 65536KB Problem Description Calculate mod (1000000000+7) for given n，m. Input ...Input contains two integers n,m(1≤n≤1000,0≤m≤10). ...
Return of the Nim Time Limit: 1000MS Memory Limit: 65536KB Problem Description ...Sherlock and Watson are playing the following modified version of Nim game: ...There are n piles of stones denot
题目 当n=2的时候是威佐夫博弈。其他时候都是nim博弈。（说起来多容易） #include<cstdio> #include<cstring> #include<algorithm> #include&... while...
问题 K: CF时间限制: 1 Sec 内存限制: 128 MB提交: 125 解决: 29[提交][状态][讨论版][命题人:外部导入]题目描述LYD loves codeforces since there are many Russian contests. In an contest lasting for T ...
company Time Limit: 1000MS Memory Limit: 65536KB Problem Description There are n kinds of goods in the company, with each of them has a inventory of and direct unit benefit ....
Problem Description LYD loves codeforces since there are many Russian contests. In an contest lasting for T minutes there are n problems, and for the ith problem you can get ai−di∗ti points, where ...
Quadrat Time Limit: 1000 ms Memory Limit: 65536 KiB Submit Statistic Problem Description It is well-known that for any n there are exactly four n-digit numbers (including ones with leading ...
Fibonacci Time Limit: 2000 ms / Memory Limit: 131072 kb Description Fibonacci numbers are well-known as follow: ...Now given an integer N, please find out whether N can be represented as the sum
sum of power Time Limit: 1000MS Memory Limit: 65536KB Problem Description Calculate mod (1000000000+7) for given n，m. ...Input contains two integers n,m(1≤n≤1000,0≤m≤10).
G - sum of power Description Input Input contains two integers n,m(1≤n≤1000,0≤m≤10). Output Output the answer in a single line. Sample Input ...注意是1e9+7不是1e8+7 #incl...
Problem DescriptionSherlock and Watson are playing the following modified version of Nim game: There are n piles of stones denoted as ,,…,, and n is a prime number; Sherlock always plays first, and...
简单的搜索题，我的英语水平都没能都懂题，惭愧惭愧~，题意是有几块(x-x1)+(y-y1)=1 and (y-y1) #include #include #include #include #include using namespace std; int dir1[4][2]={1,0,-1,0,0,1,0,-1}; ...
company Time Limit: 1000MS Memory Limit: 65536KB Submit Statistic Discuss ...There are n kinds of goods in the company, with each of them has a inventory of and ... direct
company Time Limit: 1000MS Memory Limit: 65536KB Problem Description There are n kinds of goods in the company, with each of them has a inventory of and direct unit benefit .......
CF Time Limit: 1000MS Memory Limit: 65536KB Problem Description LYD loves codeforces since there are many Russian contests. In an contest lasting for T minutes there are n problems, and f
#include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; const int maxn=1e5+5; int a[maxn];... int t,n,i; scanf("%d
#include #include #include #include using namespace std; struct node { int s,d,t; }a[2005]; bool cmp(node a,node b) { return a.t*b.d*b.t; } int dp[5005]; int main() ... int n,T,i,j;
给定n个数，求有多少对（ai，bi）满足ai×bi为一个square number，其中i != j。 思路： 除1之外的任何一个整数都可分解为有限个质数的乘积，所以可以推得两个数分解为质因数乘积之后的乘积，只有满足任意一个...
Problem Description LYD loves codeforces since there are many Russian contests. In an contest lasting for... T minutes there are n problems, and for the ith problem you can get ...ai−di∗ti points, wh